Numerical differentiation of experimental data: local versus global methods
نویسندگان
چکیده
منابع مشابه
Numerical differentiation of experimental data: local versus global methods
In the context of the analysis of measured data, one is often faced with the task to differentiate data numerically. Typically, this occurs when measured data are concerned or data are evaluated numerically during the evolution of partial or ordinary differential equations. Usually, one does not take care for accuracy of the resulting estimates of derivatives because modern computers are assume...
متن کاملNumerical differentiation: local versus global methods
In this article, we present investigations on several techniques for numerical differentiation of data. Local techniques are confronted with global approaches and the differences are discussed in detail. Two basic quantities are used for characterization of results: The variance of the difference of the true derivative and its estimate, and the smoothness of the estimate. We apply the different...
متن کاملMethods for Numerical Differentiation of Noisy Data
We describe several methods for the numerical approximation of a first derivative of a smooth real-valued univariate function for which only discrete noise-contaminated data values are given. The methods allow for both uniformly distributed and non-uniformly distributed abscissae. They are compared for accuracy on artificial data sets constructed by adding Gaussian noise to simple test function...
متن کاملParallel implementation issues: global versus local methods
Climate modeling differs from weather forecasting primarily in terms of the spatial resolution and timescales involved. For example, weather models run at high resolution for short periods (from two to 10 days), whereas climate models run for decades or centuries of simulated time at much lower resolution to make the computations tractable. There are on the order of 100,000 to 1 million grid po...
متن کاملGlobal Versus Local Methods in Nonlinear Dimensionality Reduction
Recently proposed algorithms for nonlinear dimensionality reduction fall broadly into two categories which have different advantages and disadvantages: global (Isomap [1]), and local (Locally Linear Embedding [2], Laplacian Eigenmaps [3]). We present two variants of Isomap which combine the advantages of the global approach with what have previously been exclusive advantages of local methods: c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2007
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2007.03.009